Approximation algorithms for some vehicle routing problems
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for some vehicle routing problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is either to minimize the total distance traveled by vehicles or to minimize the number of vehicles used. We design constant differential approximation algorithms for kVRP. Note that, using the differential bound for Metric 3VRP, we obtain the randomized standa...
متن کاملApproximation algorithms for distance constrained vehicle routing problems
We study the distance constrained vehicle routing problem (DVRP) [20, 21]: given a set of vertices in a metric space, a specified depot, and a distance bound D, find a minimum cardinality set of tours originating at the depot that covers all vertices, such that each tour has length at most D. This problem is NP-complete, even when the underlying metric is induced by a weighted star. Our main re...
متن کاملApproximation algorithms for regret minimization in vehicle routing problems
In this thesis, we present new approximation algorithms as well as hardness of approximation results for N P-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such as logistics, robotics, or distribution systems. For the first problem class, the goal is to visit as many locations in a network as possible...
متن کاملPoly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed k-TSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ |V |, compute the minimum length tour that contains r and at least k other vertices. We present a polynomial time O(log n · log k)-approximation algorithm for this problem. We use this algorithm for directed k-TSP t...
متن کاملOptimization of Multiple Vehicle Routing Problems using Approximation Algorithms
This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP). We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. kMeans clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.07.003